0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM 0.12/0.33 % Computer : n001.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1920 0.12/0.33 % WCLimit : 240 0.12/0.33 % DateTime : Wed Jul 30 03:54:19 EDT 2025 0.12/0.33 % CPUTime : 0.20/0.48 Running higher-order theorem proving 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.vfIZ6iwwgp/E---3.1_10293.p 0.20/0.51 # Version: 3.0.0-ho 0.20/0.51 # Preprocessing class: HSSSSLSSSLMNHSA. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.51 # Starting new_ho_10 with 1200s (5) cores 0.20/0.51 # Starting new_ho_7 with 240s (1) cores 0.20/0.51 # Starting lpo8_lambda_fix with 240s (1) cores 0.20/0.51 # Starting lpo9_lambda_fix with 240s (1) cores 0.20/0.51 # lpo8_lambda_fix with pid 10423 completed with status 0 0.20/0.51 # Result found by lpo8_lambda_fix 0.20/0.51 # Preprocessing class: HSSSSLSSSLMNHSA. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.51 # Starting new_ho_10 with 1200s (5) cores 0.20/0.51 # Starting new_ho_7 with 240s (1) cores 0.20/0.51 # Starting lpo8_lambda_fix with 240s (1) cores 0.20/0.51 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0) 0.20/0.51 # Search class: HGHSF-FFSS32-MHSFMSBN 0.20/0.51 # partial match(4): HGHSM-FSLS32-MHSFFSBN 0.20/0.51 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.51 # Starting new_ho_9 with 141s (1) cores 0.20/0.51 # new_ho_9 with pid 10429 completed with status 0 0.20/0.51 # Result found by new_ho_9 0.20/0.51 # Preprocessing class: HSSSSLSSSLMNHSA. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.51 # Starting new_ho_10 with 1200s (5) cores 0.20/0.51 # Starting new_ho_7 with 240s (1) cores 0.20/0.51 # Starting lpo8_lambda_fix with 240s (1) cores 0.20/0.51 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0) 0.20/0.51 # Search class: HGHSF-FFSS32-MHSFMSBN 0.20/0.51 # partial match(4): HGHSM-FSLS32-MHSFFSBN 0.20/0.51 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.51 # Starting new_ho_9 with 141s (1) cores 0.20/0.51 # Preprocessing time : 0.002 s 0.20/0.51 # Presaturation interreduction done 0.20/0.51 0.20/0.51 # Proof found! 0.20/0.51 # SZS status Theorem 0.20/0.51 # SZS output start CNFRefutation 0.20/0.51 thf(decl_23, type, in: $i > $i > $o). 0.20/0.51 thf(decl_24, type, emptyset: $i). 0.20/0.51 thf(decl_25, type, setadjoin: $i > $i > $i). 0.20/0.51 thf(decl_26, type, setunion: $i > $i). 0.20/0.51 thf(decl_27, type, dsetconstr: $i > ($i > $o) > $i). 0.20/0.51 thf(decl_28, type, setadjoinIL: $o). 0.20/0.51 thf(decl_29, type, iskpair: $i > $o). 0.20/0.51 thf(decl_30, type, singleton: $i > $o). 0.20/0.51 thf(decl_31, type, ex1: $i > ($i > $o) > $o). 0.20/0.51 thf(decl_32, type, ex1I: $o). 0.20/0.51 thf(decl_33, type, setukpairinjL1: $o). 0.20/0.51 thf(decl_34, type, esk1_3: $i > ($i > $o) > $i > $i). 0.20/0.51 thf(decl_35, type, esk2_3: $i > ($i > $o) > $i > $i). 0.20/0.51 thf(decl_36, type, esk3_0: $i). 0.20/0.51 thf(decl_37, type, esk4_0: $i). 0.20/0.51 thf(decl_38, type, esk5_0: $i). 0.20/0.51 thf(decl_39, type, epred1_0: $i > $o). 0.20/0.51 thf(ex1, axiom, ((ex1)=(^[X3:$i, X4:$i > $o]:((singleton @ (dsetconstr @ X3 @ (^[X1:$i]:((X4 @ X1)))))))), file('/export/starexec/sandbox/tmp/tmp.vfIZ6iwwgp/E---3.1_10293.p', ex1)). 0.20/0.51 thf(singleton, axiom, ((singleton)=(^[X3:$i]:(?[X1:$i]:(((in @ X1 @ X3)&((X3)=(setadjoin @ X1 @ emptyset))))))), file('/export/starexec/sandbox/tmp/tmp.vfIZ6iwwgp/E---3.1_10293.p', singleton)). 0.20/0.51 thf(ex1I, axiom, ((ex1I)<=>![X3:$i, X4:$i > $o, X1:$i]:(((in @ X1 @ X3)=>((X4 @ X1)=>(![X2:$i]:(((in @ X2 @ X3)=>((X4 @ X2)=>((X2)=(X1)))))=>(ex1 @ X3 @ (^[X2:$i]:((X4 @ X2))))))))), file('/export/starexec/sandbox/tmp/tmp.vfIZ6iwwgp/E---3.1_10293.p', ex1I)). 0.20/0.51 thf(iskpair, axiom, ((iskpair)=(^[X3:$i]:(?[X1:$i]:(((in @ X1 @ (setunion @ X3))&?[X2:$i]:(((in @ X2 @ (setunion @ X3))&((X3)=(setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset)))))))))), file('/export/starexec/sandbox/tmp/tmp.vfIZ6iwwgp/E---3.1_10293.p', iskpair)). 0.20/0.51 thf(kfstsingleton, conjecture, (((![X6:$i]:(((singleton @ (dsetconstr @ (setunion @ X6) @ (^[X1:$i]:((in @ (setadjoin @ X1 @ emptyset) @ X6)))))<=(iskpair @ X6)))<=(setukpairinjL1))<=(ex1I))<=(setadjoinIL)), file('/export/starexec/sandbox/tmp/tmp.vfIZ6iwwgp/E---3.1_10293.p', kfstsingleton)). 0.20/0.51 thf(setadjoinIL, axiom, ((setadjoinIL)<=>![X1:$i, X2:$i]:((in @ X1 @ (setadjoin @ X1 @ X2)))), file('/export/starexec/sandbox/tmp/tmp.vfIZ6iwwgp/E---3.1_10293.p', setadjoinIL)). 0.20/0.51 thf(setukpairinjL1, axiom, ((setukpairinjL1)<=>![X1:$i, X2:$i, X5:$i]:(((in @ (setadjoin @ X5 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset)))=>((X1)=(X5))))), file('/export/starexec/sandbox/tmp/tmp.vfIZ6iwwgp/E---3.1_10293.p', setukpairinjL1)). 0.20/0.51 thf(c_0_7, plain, ((ex1)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((?[X17:$i]:(((in @ X17 @ (dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2)))))&((dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2))))=(setadjoin @ X17 @ emptyset)))))))), inference(fof_simplification,[status(thm)],[ex1])). 0.20/0.51 thf(c_0_8, plain, ((singleton)=(^[Z0/* 5 */:$i]:(?[X1:$i]:(((in @ X1 @ Z0)&((Z0)=(setadjoin @ X1 @ emptyset))))))), inference(fof_simplification,[status(thm)],[singleton])). 0.20/0.51 thf(c_0_9, plain, ((ex1I)<=>![X3:$i, X4:$i > $o, X1:$i]:(((in @ X1 @ X3)=>((X4 @ X1)=>(![X2:$i]:(((in @ X2 @ X3)=>((X4 @ X2)=>((X2)=(X1)))))=>(ex1 @ X3 @ (^[Z0/* 3 */:$i]:((X4 @ Z0))))))))), inference(fof_simplification,[status(thm)],[ex1I])). 0.20/0.51 thf(c_0_10, plain, ((ex1)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((?[X17:$i]:(((in @ X17 @ (dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2)))))&((dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((Z1 @ Z2))))=(setadjoin @ X17 @ emptyset)))))))), inference(apply_def,[status(thm)],[c_0_7, c_0_8])). 0.20/0.51 thf(c_0_11, plain, ((iskpair)=(^[Z0/* 5 */:$i]:(?[X1:$i]:(((in @ X1 @ (setunion @ Z0))&?[X2:$i]:(((in @ X2 @ (setunion @ Z0))&((Z0)=(setadjoin @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X1 @ (setadjoin @ X2 @ emptyset)) @ emptyset)))))))))), inference(fof_simplification,[status(thm)],[iskpair])). 0.20/0.51 thf(c_0_12, plain, ((ex1I)=(![X3:$i, X4:$i > $o, X1:$i]:(((in @ X1 @ X3)=>((X4 @ X1)=>(![X2:$i]:(((in @ X2 @ X3)=>((X4 @ X2)=>((X2)=(X1)))))=>(?[X18:$i]:(((in @ X18 @ (dsetconstr @ X3 @ (^[Z0/* 3 */:$i]:(((X4 @ Z0))))))&((dsetconstr @ X3 @ (^[Z0/* 3 */:$i]:(((X4 @ Z0)))))=(setadjoin @ X18 @ emptyset))))))))))), inference(apply_def,[status(thm)],[c_0_9, c_0_10])). 0.20/0.51 thf(c_0_13, negated_conjecture, ~((![X30:$i, X31:$i]:((in @ X30 @ (setadjoin @ X30 @ X31)))=>(![X25:$i, X26:$i > $o, X27:$i]:(((in @ X27 @ X25)=>((X26 @ X27)=>(![X28:$i]:(((in @ X28 @ X25)=>((X26 @ X28)=>((X28)=(X27)))))=>?[X29:$i]:(((in @ X29 @ (dsetconstr @ X25 @ X26))&((dsetconstr @ X25 @ X26)=(setadjoin @ X29 @ emptyset))))))))=>(![X22:$i, X23:$i, X24:$i]:(((in @ (setadjoin @ X24 @ emptyset) @ (setadjoin @ (setadjoin @ X22 @ emptyset) @ (setadjoin @ (setadjoin @ X22 @ (setadjoin @ X23 @ emptyset)) @ emptyset)))=>((X22)=(X24))))=>![X6:$i]:((?[X20:$i]:(((in @ X20 @ (setunion @ X6))&?[X21:$i]:(((in @ X21 @ (setunion @ X6))&((X6)=(setadjoin @ (setadjoin @ X20 @ emptyset) @ (setadjoin @ (setadjoin @ X20 @ (setadjoin @ X21 @ emptyset)) @ emptyset)))))))=>?[X19:$i]:(((in @ X19 @ (dsetconstr @ (setunion @ X6) @ (^[Z0/* 3 */:$i]:((in @ (setadjoin @ Z0 @ emptyset) @ X6)))))&((dsetconstr @ (setunion @ X6) @ (^[Z0/* 3 */:$i]:((in @ (setadjoin @ Z0 @ emptyset) @ X6))))=(setadjoin @ X19 @ emptyset)))))))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[kfstsingleton])]), setadjoinIL]), c_0_8]), c_0_11]), setukpairinjL1]), c_0_12])])])). 0.20/0.51 thf(c_0_14, negated_conjecture, ![X32:$i, X33:$i, X34:$i, X35:$i > $o, X36:$i, X39:$i, X40:$i, X41:$i, X45:$i]:(((in @ X32 @ (setadjoin @ X32 @ X33))&(((((in @ (esk2_3 @ X34 @ X35 @ X36) @ (dsetconstr @ X34 @ X35))|(in @ (esk1_3 @ X34 @ X35 @ X36) @ X34)|~(X35 @ X36)|~(in @ X36 @ X34))&(((dsetconstr @ X34 @ X35)=(setadjoin @ (esk2_3 @ X34 @ X35 @ X36) @ emptyset))|(in @ (esk1_3 @ X34 @ X35 @ X36) @ X34)|~(X35 @ X36)|~(in @ X36 @ X34)))&((((in @ (esk2_3 @ X34 @ X35 @ X36) @ (dsetconstr @ X34 @ X35))|(X35 @ (esk1_3 @ X34 @ X35 @ X36))|~(X35 @ X36)|~(in @ X36 @ X34))&(((dsetconstr @ X34 @ X35)=(setadjoin @ (esk2_3 @ X34 @ X35 @ X36) @ emptyset))|(X35 @ (esk1_3 @ X34 @ X35 @ X36))|~(X35 @ X36)|~(in @ X36 @ X34)))&(((in @ (esk2_3 @ X34 @ X35 @ X36) @ (dsetconstr @ X34 @ X35))|((esk1_3 @ X34 @ X35 @ X36)!=(X36))|~(X35 @ X36)|~(in @ X36 @ X34))&(((dsetconstr @ X34 @ X35)=(setadjoin @ (esk2_3 @ X34 @ X35 @ X36) @ emptyset))|((esk1_3 @ X34 @ X35 @ X36)!=(X36))|~(X35 @ X36)|~(in @ X36 @ X34)))))&((~(in @ (setadjoin @ X41 @ emptyset) @ (setadjoin @ (setadjoin @ X39 @ emptyset) @ (setadjoin @ (setadjoin @ X39 @ (setadjoin @ X40 @ emptyset)) @ emptyset)))|((X39)=(X41)))&(((in @ esk4_0 @ (setunion @ esk3_0))&((in @ esk5_0 @ (setunion @ esk3_0))&((esk3_0)=(setadjoin @ (setadjoin @ esk4_0 @ emptyset) @ (setadjoin @ (setadjoin @ esk4_0 @ (setadjoin @ esk5_0 @ emptyset)) @ emptyset)))))&(~(in @ X45 @ (dsetconstr @ (setunion @ esk3_0) @ (^[Z0/* 3 */:$i]:((in @ (setadjoin @ Z0 @ emptyset) @ esk3_0)))))|((dsetconstr @ (setunion @ esk3_0) @ (^[Z0/* 3 */:$i]:((in @ (setadjoin @ Z0 @ emptyset) @ esk3_0))))!=(setadjoin @ X45 @ emptyset)))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])])). 0.20/0.51 thf(c_0_15, plain, ![X48:$i]:(((~(epred1_0 @ X48)|(in @ (setadjoin @ X48 @ emptyset) @ esk3_0))&(~(in @ (setadjoin @ X48 @ emptyset) @ esk3_0)|(epred1_0 @ X48)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])). 0.20/0.51 thf(c_0_16, negated_conjecture, ![X1:$i, X2:$i]:((in @ X1 @ (setadjoin @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.51 thf(c_0_17, negated_conjecture, ((esk3_0)=(setadjoin @ (setadjoin @ esk4_0 @ emptyset) @ (setadjoin @ (setadjoin @ esk4_0 @ (setadjoin @ esk5_0 @ emptyset)) @ emptyset))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.51 thf(c_0_18, negated_conjecture, ![X4:$i > $o, X2:$i, X1:$i]:((((dsetconstr @ X1 @ X4)=(setadjoin @ (esk2_3 @ X1 @ X4 @ X2) @ emptyset))|(X4 @ (esk1_3 @ X1 @ X4 @ X2))|~((X4 @ X2))|~((in @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.51 thf(c_0_19, negated_conjecture, (in @ esk4_0 @ (setunion @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.51 thf(c_0_20, plain, ![X1:$i]:(((epred1_0 @ X1)|~((in @ (setadjoin @ X1 @ emptyset) @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.20/0.51 thf(c_0_21, negated_conjecture, (in @ (setadjoin @ esk4_0 @ emptyset) @ esk3_0), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.20/0.51 thf(c_0_22, plain, ![X46:$i]:(((epred1_0 @ X46)<=>(in @ (setadjoin @ X46 @ emptyset) @ esk3_0))), introduced(definition)). 0.20/0.51 thf(c_0_23, negated_conjecture, ![X4:$i > $o]:((((setadjoin @ (esk2_3 @ (setunion @ esk3_0) @ X4 @ esk4_0) @ emptyset)=(dsetconstr @ (setunion @ esk3_0) @ X4))|(X4 @ (esk1_3 @ (setunion @ esk3_0) @ X4 @ esk4_0))|~((X4 @ esk4_0)))), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.20/0.51 thf(c_0_24, plain, (epred1_0 @ esk4_0), inference(spm,[status(thm)],[c_0_20, c_0_21])). 0.20/0.51 thf(c_0_25, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((((X2)=(X1))|~((in @ (setadjoin @ X1 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ emptyset) @ (setadjoin @ (setadjoin @ X2 @ (setadjoin @ X3 @ emptyset)) @ emptyset)))))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.51 thf(c_0_26, negated_conjecture, ![X1:$i]:((~((((in @ X1 @ (dsetconstr @ (setunion @ esk3_0) @ epred1_0)))=(($true))))|((dsetconstr @ (setunion @ esk3_0) @ epred1_0)!=(setadjoin @ X1 @ emptyset)))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_14]), c_0_22]), c_0_22])). 0.20/0.51 thf(c_0_27, plain, (((setadjoin @ (esk2_3 @ (setunion @ esk3_0) @ epred1_0 @ esk4_0) @ emptyset)=(dsetconstr @ (setunion @ esk3_0) @ epred1_0))|(epred1_0 @ (esk1_3 @ (setunion @ esk3_0) @ epred1_0 @ esk4_0))), inference(spm,[status(thm)],[c_0_23, c_0_24])). 0.20/0.51 thf(c_0_28, negated_conjecture, ![X1:$i]:((((X1)=(esk4_0))|~((in @ (setadjoin @ X1 @ emptyset) @ esk3_0)))), inference(spm,[status(thm)],[c_0_25, c_0_17])). 0.20/0.51 thf(c_0_29, plain, ![X1:$i]:(((in @ (setadjoin @ X1 @ emptyset) @ esk3_0)|~((epred1_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.20/0.51 thf(c_0_30, negated_conjecture, ![X1:$i]:((((dsetconstr @ (setunion @ esk3_0) @ epred1_0)!=(setadjoin @ X1 @ emptyset))|~((in @ X1 @ (dsetconstr @ (setunion @ esk3_0) @ epred1_0))))), inference(cn,[status(thm)],[c_0_26])). 0.20/0.51 thf(c_0_31, negated_conjecture, ((in @ (esk2_3 @ (setunion @ esk3_0) @ epred1_0 @ esk4_0) @ (dsetconstr @ (setunion @ esk3_0) @ epred1_0))|(epred1_0 @ (esk1_3 @ (setunion @ esk3_0) @ epred1_0 @ esk4_0))), inference(spm,[status(thm)],[c_0_16, c_0_27])). 0.20/0.51 thf(c_0_32, negated_conjecture, ![X4:$i > $o, X2:$i, X1:$i]:(((in @ (esk2_3 @ X1 @ X4 @ X2) @ (dsetconstr @ X1 @ X4))|((esk1_3 @ X1 @ X4 @ X2)!=(X2))|~((X4 @ X2))|~((in @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.51 thf(c_0_33, plain, ![X1:$i]:((((X1)=(esk4_0))|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_28, c_0_29])). 0.20/0.51 thf(c_0_34, negated_conjecture, (epred1_0 @ (esk1_3 @ (setunion @ esk3_0) @ epred1_0 @ esk4_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_27])). 0.20/0.51 thf(c_0_35, negated_conjecture, ![X1:$i]:((((setadjoin @ (esk2_3 @ (setunion @ esk3_0) @ epred1_0 @ X1) @ emptyset)!=(dsetconstr @ (setunion @ esk3_0) @ epred1_0))|((esk1_3 @ (setunion @ esk3_0) @ epred1_0 @ X1)!=(X1))|~((in @ X1 @ (setunion @ esk3_0)))|~((epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_30, c_0_32])). 0.20/0.51 thf(c_0_36, plain, ((esk1_3 @ (setunion @ esk3_0) @ epred1_0 @ esk4_0)=(esk4_0)), inference(spm,[status(thm)],[c_0_33, c_0_34])). 0.20/0.51 thf(c_0_37, negated_conjecture, ((setadjoin @ (esk2_3 @ (setunion @ esk3_0) @ epred1_0 @ esk4_0) @ emptyset)!=(dsetconstr @ (setunion @ esk3_0) @ epred1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_19]), c_0_24])])). 0.20/0.51 thf(c_0_38, negated_conjecture, ![X4:$i > $o, X2:$i, X1:$i]:((((dsetconstr @ X1 @ X4)=(setadjoin @ (esk2_3 @ X1 @ X4 @ X2) @ emptyset))|((esk1_3 @ X1 @ X4 @ X2)!=(X2))|~((X4 @ X2))|~((in @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.51 thf(c_0_39, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_36]), c_0_19]), c_0_24])]), ['proof']). 0.20/0.51 # SZS output end CNFRefutation 0.20/0.51 # Parsed axioms : 18 0.20/0.51 # Removed by relevancy pruning/SinE : 11 0.20/0.51 # Initial clauses : 14 0.20/0.51 # Removed in clause preprocessing : 0 0.20/0.51 # Initial clauses in saturation : 14 0.20/0.51 # Processed clauses : 53 0.20/0.51 # ...of these trivial : 0 0.20/0.51 # ...subsumed : 2 0.20/0.51 # ...remaining for further processing : 51 0.20/0.51 # Other redundant clauses eliminated : 0 0.20/0.51 # Clauses deleted for lack of memory : 0 0.20/0.51 # Backward-subsumed : 0 0.20/0.51 # Backward-rewritten : 7 0.20/0.51 # Generated clauses : 69 0.20/0.51 # ...of the previous two non-redundant : 66 0.20/0.51 # ...aggressively subsumed : 0 0.20/0.51 # Contextual simplify-reflections : 1 0.20/0.51 # Paramodulations : 69 0.20/0.51 # Factorizations : 0 0.20/0.51 # NegExts : 0 0.20/0.51 # Equation resolutions : 0 0.20/0.51 # Disequality decompositions : 0 0.20/0.51 # Total rewrite steps : 14 0.20/0.51 # ...of those cached : 10 0.20/0.51 # Propositional unsat checks : 0 0.20/0.51 # Propositional check models : 0 0.20/0.51 # Propositional check unsatisfiable : 0 0.20/0.51 # Propositional clauses : 0 0.20/0.51 # Propositional clauses after purity: 0 0.20/0.51 # Propositional unsat core size : 0 0.20/0.51 # Propositional preprocessing time : 0.000 0.20/0.51 # Propositional encoding time : 0.000 0.20/0.51 # Propositional solver time : 0.000 0.20/0.51 # Success case prop preproc time : 0.000 0.20/0.51 # Success case prop encoding time : 0.000 0.20/0.51 # Success case prop solver time : 0.000 0.20/0.51 # Current number of processed clauses : 30 0.20/0.51 # Positive orientable unit clauses : 7 0.20/0.51 # Positive unorientable unit clauses: 0 0.20/0.51 # Negative unit clauses : 1 0.20/0.51 # Non-unit-clauses : 22 0.20/0.51 # Current number of unprocessed clauses: 41 0.20/0.51 # ...number of literals in the above : 173 0.20/0.51 # Current number of archived formulas : 0 0.20/0.51 # Current number of archived clauses : 21 0.20/0.51 # Clause-clause subsumption calls (NU) : 72 0.20/0.51 # Rec. Clause-clause subsumption calls : 32 0.20/0.51 # Non-unit clause-clause subsumptions : 3 0.20/0.51 # Unit Clause-clause subsumption calls : 7 0.20/0.51 # Rewrite failures with RHS unbound : 0 0.20/0.51 # BW rewrite match attempts : 3 0.20/0.51 # BW rewrite match successes : 2 0.20/0.51 # Condensation attempts : 53 0.20/0.51 # Condensation successes : 0 0.20/0.51 # Termbank termtop insertions : 4167 0.20/0.51 # Search garbage collected termcells : 568 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.010 s 0.20/0.51 # System time : 0.003 s 0.20/0.51 # Total time : 0.013 s 0.20/0.51 # Maximum resident set size: 1908 pages 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.011 s 0.20/0.51 # System time : 0.006 s 0.20/0.51 # Total time : 0.016 s 0.20/0.51 # Maximum resident set size: 1736 pages 0.20/0.51 % E exiting 0.20/0.51 % E exiting 0.20/0.51 EOF